Proving programs terminate using well orderings, Ramsey Theory, and Matrices
نویسنده
چکیده
Many programs allow the user to input data several times during its execution. If the program runs forever the user may input data infinitely often. A program terminates if it terminates no matter what the user does. We discuss various ways to prove that program terminates. The proofs use well orderings, Ramsey Theory, and Matrices. These techniques are used by real program checkers. General Terms: Verification, Theory.
منابع مشابه
Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices
Many programs allow the user to input data several times during its execution. If the program runs forever the user may input data infinitely often. A program terminates if it terminates no matter what the user does. We discuss various ways to prove that program terminates. The proofs use wellfounded orders, Ramsey Theorem, and matrices. These techniques are used by real program checkers. Gener...
متن کاملAn Application of Ramsey ’ s Theorem to Proving Programs Terminate Exposition
We describe an application of Ramsey’s Theorem to proving programs terminate, by which we mean terminate on any input. This paper is self contained; it does not require knowledge of either Ramsey’s Theorem or Programming Languages. Our account is based on the articles of B. Cook, Podelski, and Rybalchenko [11, 26] and Lee, Jones, and Ben-Amram [21]. Many other papers [9, 10, 25, 27, 28] have us...
متن کاملAn Application of Ramsey ’ s Theorem to Proving Programs
We describe an application of Ramsey’s Theorem to proving programs terminate. This paper is self contained; it does not require knowledge of either field. Our account is based on two articles, one by B. Cook, Podelski, and Rybalchenko [5] and one by Podelski and Rybalchenko [19]. Many other papers that also used this application [3, 4, 18, 20, 21]. Termination checkers that have used this appli...
متن کاملA Framework of Directionality for Proving Termination of Logic Programs
In this paper we propose a rich notion of directionality of predicates that combines modes and regular tree types. We provide a semantic soundness result for this notion and give inference systems to decide well-modedness of logic programs and goals. We show how this rich notion of directionality can be used to prove the universal termination of LD-resolution for logic programs with non-ground ...
متن کاملA proof theoretic study of abstract termination principles
We define a variety of abstract termination principles which form generalisations of simplification orders, and investigate their computational content. Simplification orders, which include the well-known multiset and lexicographic path orderings, are important techniques for proving that computer programs terminate. Moreover, an analysis of the proofs that these orders are wellfounded can yiel...
متن کامل